Background on Weil Descent
نویسندگان
چکیده
CRC Press has granted the following specific permissions for the electronic version of this book: Permission is granted to retrieve a copy of this chapter for personal use. This permission does not extend to binding multiple chapters of the book, photocopying or producing copies for other than personal use of the person creating the copy, or making electronic copies available for retrieval by others without prior permission in writing from CRC Press.
منابع مشابه
Descent Identities, Hessenberg Varieties, and the Weil Conjectures
We apply the Weil conjectures to the Hessenberg Varieties to obtain information about the combinatorics of descents in the symmetric group. Combining this with elementary linear algebra leads to elegant proofs of some identities from the theory of descents. 3
متن کاملWeil Descent Attacks
This article is to appear as a chapter in Advances in Elliptic Curve Cryptography, edited by I. Blake, G. Seroussi and N. Smart, Cambridge University Press, 2004. It summarises the main aspects of the existing literature on Weil descent attacks and contains some new material on the GHS attack in even characteristic.
متن کاملOn Security of Superelliptic Curves Based Cryptosystems against GHS Weil Descent Attacks
The GHS Weil descent attack by Gaudry, Hess and Smart was originally proposed to elliptic curves over finite fields of characteristic two [11]. Among a number of extensions of this attack, Diem treated the cases of hyperelliptic curves over finite fields of arbitrary odd characteristics [4]. His results were partially extended to algebraic curves of which the function fields are cyclic Galois e...
متن کاملLast Fall Degree, HFE, and Weil Descent Attacks on ECDLP
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic assumptions. In this paper we introduce the noti...
متن کاملOn the last fall degree of zero-dimensional Weil descent systems
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gröbner basis computations and the heuristic first fall degree assumption and is not based on any heuristic. This method relies on the new concept of last fall degree. Let k be a finite field of cardinality qn and let k be its subfield of cardinality q. Let ...
متن کاملA Cryptographic Application of Weil Descent
This paper gives some details about how Weil descent can be used to solve the discrete logarithm problem on elliptic curves which are de ned over nite elds of small characteristic. The original ideas were rst introduced into cryptography by Frey. We discuss whether these ideas are a threat to existing public key systems based on elliptic curves.
متن کامل